#define _CRT_SECURE_NO_WARNINGS
#include"BinaryTree.h"
int main()
{
	
	char a[100] = { 0 };
	int i = 0;
	scanf("%s", a);
	BTNode* tree = BinaryTreeCreate(a, &i);
	
	//int size = BinaryTreeSize(tree);
	//printf("%d\n", size);
	//int size1 = BinaryTreeLeafSize(tree);
	//printf("%d\n", size1);
	//int size2 = BinaryTreeLevelKSize(tree,2);
	//printf("%d\n", size2);
	//BTNode* find = BinaryTreeFind(tree, 'E');
	//printf("%c\n", find->_data);
	//BinaryTreePrevOrder(tree);
	//printf("\n");
	//BinaryTreeInOrder(tree);
	//printf("\n");
	//BinaryTreePostOrder(tree);
	//printf("\n");
	
	BinaryTreeLevelOrder(tree);
	BinaryTreeComplete(tree);
	BinaryTreeDestory(&tree);
	return 0;
}
//ABD##E#H##CF##G##